Two Approaches to Building Time-Windowed Geometric Data Structures

Two Approaches to Building Time-Windowed Geometric Data Structures

Given a set of geometric objects each associated with a time value, we wish to determine whether a given property is true for a subset of those objects whose time values fall within a query time window. We call such problems time-windowed decision problems, and they have been the subject of much recent attention, for instance studied by Bokal, Cabello, and Eppstein [SoCG 2015]. In this paper, w...

Windows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point Sets

We study geometric data structures for sets of point-based temporal events, answering time-windowed queries, i.e., given a contiguous time interval we answer common geometric queries about the point events with time stamps in this interval. The geometric queries we consider include queries based on the skyline, convex hull, and proximity relations of the point set. We provide space efficient da...

External Geometric Data Structures

Many modern applications store and process datasets much larger than the main memory of even state-of-the-art high-end machines. Thus massive and dynamically changing datasets often need to be stored in space efficient data structures on external storage devices such as disks, and in such cases the Input/Output (or I/O) communication between internal and external memory can become a major perfo...

Geometric Data Structures

Approaches to Building Metadata for Data Curation

In National Taiwan University (NTU), the Library aims to provide data curation services for university researchers from different research fields, particularly focusing on those from small sciences. In this paper, we will first investigate existing metadata schemas used for data curation services in North America and Europe. Next, we will attempt to develop an application profile, proposing met...